Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 71-87).

1. Introduction --

2. Preference modeling and reasoning -- 2.1 Constraint reasoning -- 2.1.1 Constraints -- 2.1.2 Constraint solvers -- 2.2 Soft constraints -- 2.2.1 Specific soft constraint formalisms -- 2.2.2 General soft constraint formalisms -- 2.2.3 Computational properties of soft constraints -- 2.2.4 Bipolar preferences -- 2.3 CP-nets -- 2.3.1 Conditional preferences -- 2.3.2 Preference ordering -- 2.3.3 Computational properties -- 2.4 Soft constraints vs. CP-nets -- 2.4.1 Expressiveness comparison -- 2.4.2 Approximating CP-nets via soft constraints -- 2.4.3 CP-nets and hard constraints -- 2.5 Temporal preferences -- 2.6 Abstracting, explaining, and eliciting preferences -- 2.6.1 Abstraction techniques -- 2.6.2 Explanation generation -- 2.6.3 Learning and preference elicitation -- 2.7 Other preference modeling frameworks -- 2.8 Conclusions --

3. Uncertainty in preference reasoning -- 3.1 Interval-based preferences -- 3.2 Missing preferences -- 3.2.1 Interleaving complete search and elicitation -- 3.2.2 Interleaving local search and elicitation -- 3.3 Conclusions --

4. Aggregating preferences -- 4.1 Voting -- 4.1.1 Voting rules -- 4.1.2 Properties of voting rules -- 4.1.3 Fairness and manipulation -- 4.1.4 Single-peaked preferences -- 4.2 Computational aspects of manipulation and control -- 4.2.1 Manipulation algorithms -- 4.2.2 Tie-breaking -- 4.2.3 Control -- 4.2.4 Hybrid rules -- 4.2.5 Manipulation on average -- 4.2.6 Manipulation in practice -- 4.2.7 Parameterized complexity -- 4.3 Mechanism design -- 4.4 Incomparability -- 4.5 Uncertainty in preference aggregation -- 4.5.1 Incomplete profiles -- 4.5.2 Unknown agenda -- 4.6 Preference compilation -- 4.7 Combinatorial domains -- 4.8 Conclusions --

5. Stable marriage problems -- 5.1 Stability -- 5.2 Ties and incompleteness -- 5.3 Manipulation -- 5.4 Extensions -- 5.5 Compact preference representation -- 5.6 Constraint-based formalizations -- 5.7 Conclusions --

Bibliography -- Authors' biographies.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

Computational social choice is an expanding field that merges classical topics like economics and voting theory with more modern topics like artificial intelligence, multiagent systems, and computational complexity. This book provides a concise introduction to the main research lines in this field, covering aspects such as preference modelling, uncertainty reasoning, social choice, stable matching, and computational aspects of preference aggregation and manipulation. The book is centered around the notion of preference reasoning, both in the single-agent and the multi-agent setting. It presents the main approaches to modeling and reasoning with preferences, with particular attention to two popular and powerful formalisms, soft constraints and CP-nets. The authors consider preference elicitation and various forms of uncertainty in soft constraints. They review the most relevant results in voting, with special attention to computational social choice. Finally, the book considers preferences in matching problems. The book is intended for students and researchers who may be interested in an introduction to preference reasoning and multi-agent preference aggregation, and who want to know the basic notions and results in computational social choice.

Also available in print.

Title from PDF t.p. (viewed on August 14, 2011).